Characterization of Deadlocks in Irregular Networks

نویسندگان

  • Sugath Warnakulasuriya
  • Timothy Mark Pinkston
چکیده

This work characterizes how various network parameters influence message blocking and deadlocks in irregular networks. Information on blocking behavior is provided that is useful in making design trade-offs between restricting routing freedom and allowing the possibility for deadlocks to form in irregular networks. This paper also identifies ways in which a network’s susceptibility to deadlock can be reduced and provides guidelines for designing irregular networks that maximize routing flexibility and resource utilization. Finally, a new empirical evaluation methodology for classifying irregular topologies and relating network behavior to various classes of network topologies is introduced. © 2001 Academic Press

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modularity, Routing and Fault Tolerance in Interconnection Networks

In interconnection networks, there are several problems related to deadlock. We shall address deadlocks in the context of modularity, shortest path routing in irregular networks and fault tolerance. Deadlock freedom in interconnection networks is not a modular issue. One cannot generally combine two or more deadlock free interconnection network configurations without introducing new deadlock pr...

متن کامل

A New Method for Deadlock Elimination in Computer Networks with Irregular Topologies

* This work has been supported by NSF grant MIP-9630096 Abstract In this paper we consider the problem of deadlock-free wormhole unicast routing in networks with irregular topologies. To prevent deadlocks, for each router some input/output pairs (turns) have to be prohibited. We analyze the problem of minimizing the number of prohibited turns for providing deadlock-free routing. A new algorithm...

متن کامل

Fast Dynamic Reconfiguration in Irregular Networks

Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes in irregular topologies. During reconfiguration of a network based on virtual cut-through or wormhole switching, however, deadlocks in the transition phase between the old and the new routing function must be avoided. The avoidance of such deadlocks will in general ma...

متن کامل

Designing Solvable Graphs for Multiple Moving Agents

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

متن کامل

An Irregular Lattice Pore Network Model Construction Algorithm

Pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. In most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. Although some methodologies for extracting geologically realistic irregular net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1999